Ray-Box Culling for Tree Structures

نویسندگان

  • Jae-Ho Nah
  • Woo-Chan Park
  • Yoon-Sig Kang
  • Tack-Don Han
چکیده

Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investigate its efficiency in terms of tree construction time and ray traversal performance. Experimental results show that our approach achieves up to 1.15× faster ray tracing performance and up to 1.22× faster total rendering performance, including tree construction and ray tracing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Risk factors affecting the culling of Iranian Holstein dairy cows

This experiment was conducted to evaluate the association between risk factors and the risk of culling in Iranian Holstein cows. The data consisted of 329,772 lactation records obtained from the Animal Breeding Center of Iran (2003 - 2012) and logistic regression was applied to investigate the associations between the predictor and response variables. The response variable in this experiment wa...

متن کامل

Reasons and risk factors for culling Holstein dairy cows in Morocco

This study was carried out in a commercial herd from 2008 to 2012 in order to determine the most prevalent reasons for culling Holstein cows and to assess the effects of risk factors. Overall, 519 (28.2%) cows were culled for involuntary (98.8%) and voluntary (1.2%) reasons. The involuntary causes of culling were diseases (38.7%), reproduction problems (36.0%), udder disorders (7.7%), lameness ...

متن کامل

Optimized occlusion culling using five-dimensional subdivision

We describe an algorithm for occlusion culling by visibility preprocessing. The algorithm intelligently partitions the "ve-dimensional viewing parameter space using a 5D tree (a k-D tree with k"5), such that each leaf of the tree contains a reference to a subset of the n scene objects. The visibility of each of the objects is determined using a ray-casting procedure. We show how to minimize the...

متن کامل

Faster Ray Tracing with SIMD Shaft Culling

This paper presents a generic technique for acceleration of ray tracing of polygonal scenes. We propose scheduling rays in a way that forms pyramidal shafts. We show that under certain conditions fulfilled by the corner rays of a shaft, it is possible to immediately and conservatively answer visibility queries for the inner rays without expensive ray traversal through acceleration data structur...

متن کامل

A Fully GPU-Based Ray-Driven Backprojector via a Ray-Culling Scheme with Voxel-Level Parallelization for Cone-Beam CT Reconstruction.

A ray-driven backprojector is based on ray-tracing, which computes the length of the intersection between the ray paths and each voxel to be reconstructed. To reduce the computational burden caused by these exhaustive intersection tests, we propose a fully graphics processing unit (GPU)-based ray-driven backprojector in conjunction with a ray-culling scheme that enables straightforward parallel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2013